Parallelization of Sphere-Decoding Methods
نویسندگان
چکیده
Sphere-Decoding (SD) methods are branch-and-bound-like techniques used for optimal detection of digital communications signals over in wireless MIMO (Multiple input Multiple Output) channels. These methods look for the optimal solution in a tree of partial solutions; the size of the tree depends on the parameters of the problem (dimension of the channel matrix, cardinality of the alphabet), and such search can be much more expensive depending on these parameters. This search often has to be carried out in real time. This paper presents parallel versions of the Sphere-Decoding method for different parallel architectures with the goal of reducing the computation time.
منابع مشابه
A new reduced-complexity sphere decoder for multiple antenna systems
Sphere decoding for multiple antenna systems has been shown to achieve near-ML performance with low complexity. However, the achievement of such an excellent performance-complexity tradeoff is highly dependent on the initial choice of sphere radius. In this paper, we present a new sphere decoding algorithm which is even less computationally complex than the original sphere decoder. Moreover, th...
متن کاملThe Sphere Decoding Algorithm applied to Space-Time Block Codes
The use of digital wireless communication systems has become more and more common during recent years. A multiple-input-multiple-output (MIMO) system using Space-Time Coding techniques can be implemented to enhance the capacity of a wireless link. The optimal decoder is based on the maximum likelihood principle. But as the number of the antennas in the system and the data rates increase, the ma...
متن کاملPerformance Evaluation of Sphere Decoding Algorithm for Spatially Multiplexed Multiple Input and Multiple Output System
The use of digital wireless communication systems has become more and more common during recent years. A multiple-input-multiple-output (MIMO) system using Space-Time Coding techniques can be implemented to enhance the capacity of a wireless link. The optimal decoder is based on the maximum likelihood principle. But as the number of the antennas in the system and the data rates increase, the ma...
متن کاملAn Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels
This paper derives an improved sphere-packing (ISP) bound for finite-length codes whose transmission takes place over symmetric memoryless channels. We first review classical results, i.e., the 1959 sphere-packing (SP59) bound of Shannon for the Gaussian channel, and the 1967 sphere-packing (SP67) bound of Shannon et al. for discrete memoryless channels. A recent improvement on the SP67 bound, ...
متن کاملParallelization of Particle Methods on the Sphere
We consider data structures and algorithms for eecient parallelization of particle methods when the domain is the surface of a sphere. Such applications typically arise when dealing with directional data. We propose a domain decomposition scheme based on geometric partitioning, that provides domains suitable for eecient implementation of requisite operations that are performed on the data in pa...
متن کامل